effective calculability造句

例句与造句

1. Next, it was necessary to identify and prove the equivalence of two notions of effective calculability.
2. This quest required that the notion of " algorithm " or " effective calculability " be pinned down, at least well enough for the quest to begin.
3. The proposal to identify these notions with the intuitive notion of effective calculability is first made in the present paper ( but see the first footnote to ? below ).
4. Since, as an informal notion, the concept of effective calculability does not have a formal definition, the thesis, although it has near-universal acceptance, cannot be formally proven.
5. The problem was that an answer first required a precise definition of " " definite general applicable prescription " ", which Princeton professor Alonzo Church would come to call " effective calculability ", and in 1928 no such definition existed.
6. It's difficult to find effective calculability in a sentence. 用effective calculability造句挺难的
7. Thus, by 1939, both Church ( 1934 ) and Turing ( 1939 ) had individually proposed that their " formal systems " should be " definitions " of " effective calculability "; neither framed their statements as " theses ".
8. Some time prior to Church's paper " An Unsolvable Problem of Elementary Number Theory " ( 1936 ) a dialog occurred between G鰀el and Church as to whether or not ?-definability was sufficient for the definition of the notion of " algorithm " and " effective calculability ".
9. "Effective calculability " : In an effort to solve the Entscheidungsproblem defined precisely by Hilbert in 1928, mathematicians first set about to define what was meant by an " effective method " or " effective calculation " or " effective calculability " ( i . e ., a calculation that would succeed ).
10. "Effective calculability " : In an effort to solve the Entscheidungsproblem defined precisely by Hilbert in 1928, mathematicians first set about to define what was meant by an " effective method " or " effective calculation " or " effective calculability " ( i . e ., a calculation that would succeed ).
11. Church's proof that the Entscheidungsproblem was unsolvable, Emil Post's definition of effective calculability as a worker mindlessly following a list of instructions to move left or right through a sequence of rooms and while there either mark or erase a paper or observe the paper and make a yes-no decision about the next instruction.
12. The fact, however, that two such widely different and ( in the opinion of the author ) equally natural definitions of effective calculability turn out to be equivalent adds to the strength of the reasons adduced below for believing that they constitute as general a characterization of this notion as is consistent with the usual intuitive understanding of it ."
13. Subsequent formalizations were framed as attempts to define " effective calculability " or " effective method "; those formalizations included the recursive functions of 1930, 1934 and 1935, Alonzo Church's lambda calculus of 1936, Emil Post's " Formulation 1 " of 1936, and Alan Turing's Turing machines of 1936 7 and 1939 . Giving a formal definition of algorithms, corresponding to the intuitive notion, remains a challenging problem.
14. Subsequent formalizations were framed as attempts to define " effective calculability " ( Kleene 1943 : 274 ) or " effective method " ( Rosser 1939 : 225 ); those formalizations included the G鰀el-Herbrand-Kleene recursive functions of 1930, 1934 and 1935, Alonzo Church's lambda calculus of 1936, Emil Post's " Formulation I " of 1936, and Alan Turing's Turing machines of 1936-7 and 1939.
15. Was the notion of " effective calculability " to be ( i ) an " axiom or axioms " in an axiomatic system, or ( ii ) merely a " definition " that " identified " two or more propositions, or ( iii ) an " empirical hypothesis " to be verified by observation of natural events, or ( iv ) or just " a proposal " for the sake of argument ( i . e . a " thesis " ).